Injective Convex Polyhedra
نویسندگان
چکیده
منابع مشابه
Detecting intersections between convex polyhedra
For a polyhedron P in R, denote by |P | its combinatorial complexity, i.e., the number of faces, edges and vertices of the polyhedra. In this paper, we revisit the classic problem of preprocessing polyhedra independently so that given two preprocessed polyhedra P and Q in R, each translated and rotated, their intersection can be tested rapidly. For d = 3 we show how to perform such a test in O(...
متن کاملRefold rigidity of convex polyhedra
We show that every convex polyhedron may be unfolded to one planar piece, and then refolded to a different convex polyhedron. If the unfolding is restricted to cut only edges of the polyhedron, we identify several polyhedra that are “edge-unfold rigid” in the sense that each of their unfoldings may only fold back to the original. For example, each of the 43,380 edge unfoldings of a dodecahedron...
متن کاملUnfolding Convex Polyhedra via Quasigeodesics
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quasigeodesic, and cutting all but a short segment of the quasigeodesic, unfolds the surface to a planar simple polygon.
متن کاملUnunfoldable polyhedra with convex faces
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In particular, we give two examples of polyhedra, one with 24 convex faces and one with 36 triangular faces, that cannot be unfolded by cutting along edges. We further ...
متن کاملAffine Unfoldings of Convex Polyhedra
We show that every convex polyhedron admits a simple edge unfolding after an affine transformation. In particular there exists no combinatorial obstruction to a positive resolution of Dürer’s unfoldability problem, which answers a question of Croft, Falconer, and Guy. Among other techniques, the proof employs a topological characterization for embeddings among the planar immersions of the disk.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2016
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-016-9810-6